/*
 * @lc app=leetcode.cn id=674 lang=java
 *
 * [674] 最长连续递增序列
 */

// @lc code=start
class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int len = nums.length;
        if(len <2) return len;
        int ans = 1,count=1;
        for(int i = 1;i<len;i++){
            if(nums[i]>nums[i-1]){
                count++;
            }else{
                ans = Math.max(ans, count);
                count = 1;
            }
        }
        return Math.max(ans, count);
    }
}
// @lc code=end

